Automata Accepting Coupled-Context-Free Languages
نویسنده
چکیده
منابع مشابه
Loosely Coupled Context-Free Devices
We present a model for distributed systems, where each node consists of two kinds of contextfree devices: grammars generate sequences of messages due to their context-free production set, which are send over the network; pushdown automata accept or reject incoming network messages with respect to their recognition rules. Assuming that the network is a broadcast medium, i.e a local area network,...
متن کاملAn approach to fuzzy context free languages
The paper studies the relationship among fuzzy context free languages and fuzzy push down automata. The degree of membership of the words to the fuzzy language generated by a context free grammar, calculated in a monoid, introduces an additional burden for the accepting push down weighted automaton. Even in the case of languages accepted by fuzzy deterministic push down automata, the relationsh...
متن کاملSemilinearity and Context-Freeness of Languages Accepted by Valence Automata
Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is considered valid if multiplying the monoid elements on the visited edges yields the identity element. By choosing suitable monoids, a variety of automata models can be obtained as special valence automata. This work is ...
متن کاملOn the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages
In Hartmanis (1980) a simple proof is given of the fact (originally proved in Valiant (1976)) that the relative succinctness of representing deterministic context-free languages by deterministic vs. nondeterministic pushdown automata is not recursively bounded, in the following sense: there is no recursive function which, for deterministic context-free languages L, can bound the size of the min...
متن کاملOn Separation by Locally Testable and Locally Threshold Testable Languages
A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007